Solving Problems Reductively

Solving optimal control problems by PSO-SVM

The optimal control of problem is about finding a control law for a given system such that a certain optimality criterion is achieved. Methods of solving the optimal control problems are divided into direct methods and mediated methods (through other equations). In this paper, the PSO- SVM indirect method is used to solve a class of optimal control problems. In this paper, we try to determine t...

An efficient approach for solving layout problems

This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...

Solving nonlinear eigenvalue problems

Solving Quadratic Assignment Problems

We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching strategy makes extensive use of dual infor...

Solving Simple Frame Problems

Most solutions to the technical frame problem in theories of actions depend on special axioms like the frame axioms, the law of inertia, or the successor state axioms. In these solutions facts about a situation are regarded and represented as properties which hold in the situation. In this article it is argued that it is often more adequate to view facts about a situation as resources which are...